public class SolutionInterview8_11 {
    public int waysToChange(int n) {
        int mod=1000000007;
        int[][] f=new int[n+1][4];
        f[0][0]=1;
        for (int i=1;i<=n;i++){
            f[i][0]=1;
            if (i>=5){
                f[i][1]=(f[i-5][0]+f[i-5][1])%mod;
            }
            if (i>=10){
                f[i][2]=((f[i-10][0]+f[i-10][1])%mod+f[i-10][2])%mod;
            }
            if (i>=25){
                f[i][3]=(((f[i-25][0]+f[i-25][1])%mod+f[i-25][2])%mod+f[i-25][3])%mod;
            }
        }
        return (((f[n][0]+f[n][1])%mod+f[n][2])%mod+f[n][3])%mod;
    }

    public static void main(String[] args) {
        System.out.println(new SolutionInterview8_11().waysToChange(10));
    }
}
